/* Copyright (C) 2008  Romolo Camplani, Marco Fortunato, Marco Marelli, Guido Rota, Fabio A. Schreiber et al.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
 */
package org.dei.perla.parser.expressions;

public class NodeBetween extends NodeLogicalOperation {

	private Node thirdNode;
	
	public NodeBetween(Node parFirst, Node parSecond, Node parThird)
	{
		super(parFirst, parSecond);
		this.thirdNode = parThird;
	}
	
	public Node getThirdNode()
	{
		return thirdNode;
	}
	
	public Constant getResult() throws ConstantCreationException, ConstantCastException, OperationNotSupportedException, DivisionByZeroException {
		return this.getFirstNode().getResult().isBetween(this.getSecondNode().getResult(), this.getThirdNode().getResult());
	}
	
	public Class<? extends Object> getResultType() throws OperationNotSupportedException {
		try {
			if (((Boolean) this.getFirstNode().getResultType().getMethod("isFullyComparable", Class.class).invoke(null, this.getSecondNode().getResultType())).booleanValue()) {
				return ConstantLogic.class;
			}
			else
				throw new OperationNotSupportedException();
		} catch (Exception e) {
			throw new OperationNotSupportedException();
		}
	}
	
	public String toString()
	{
		return this.getFirstNode() + " BETWEEN " + this.getSecondNode() + " AND " + this.thirdNode.toString();
	}
}
